COUNTABLE DECOMPOSABILITY OF VECTOR LATTICES

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An equivalence functor between local vector lattices and vector lattices

We call a local vector lattice any vector lattice with a distinguished positive strong unit and having exactly one maximal ideal (its radical). We provide a short study of local vector lattices. In this regards, some characterizations of local vector lattices are given. For instance, we prove that a vector lattice with a distinguished strong unit is local if and only if it is clean with non no-...

متن کامل

Countable Homogeneous Lattices

We show that there are uncountably many countable homogeneous lattices. We give a discussion of which such lattices can be modular or distributive. The method applies to show that certain other classes of structures also have uncountably many homogeneous members.

متن کامل

Characterization of Partial Lattices on Countable Boolean Lattice

In this paper new concepts countable join property, countable meet property, P–lattice and Pδ –lattice are introduced. We established that P–lattice and Pδ –lattice are measureable partial lattices and characterized partial lattices of a lattice through countable join and meet properties. We also established some interesting result on the injective property of the lattice measurable functio...

متن کامل

Truncated Vector Lattices

In analysis, truncation is the operation of replacing a nonnegative real-valued function a (x) by its pointwise meet a (x) ∧ 1 with the constant 1 function. A vector lattice A is said to be closed under truncation if a ∧ 1 ∈ A for all a ∈ A. Note that A need not contain 1 itself. Truncation is fundamental to analysis. To give only one example, Lebesgue integration generalizes beautifully to any...

متن کامل

Partitions and indivisibility properties of countable dimensional vector spaces

8 We investigate infinite versions of vector and affine space partition 9 results, and thus obtain examples and a counterexample for a parti10 tion problem for relational structures. In particular we provide two 11 (related) examples of an age indivisible relational structure which is 12 not weakly indivisible. 13

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Hokkaido Mathematical Journal

سال: 1966

ISSN: 0385-4035

DOI: 10.14492/hokmj/1530518423